Subdivision algorithms converge quadratically
نویسندگان
چکیده
منابع مشابه
Quadratically Converging Algorithms for it
We present a quadratically converging algorithm for m based on a formula of Legendre's for complete elliptic integrals of modulus sin(w/12) and the arithmetic-geometric mean iteration of Gauss and Legendre. Precise asymptotics are provided which show this algorithm to be (marginally) the most efficient developed to date. As such it provides a natural computational check for the recent large-sca...
متن کاملApproximate Zeros of Quadratically Convergent Algorithms
Smale's condition for a point to be an approximate zero of a function for Newton's method is extended to the general quadratically convergent iterative algorithm. It is shown in which way the bound in the condition is affected by the characteristics of the algorithm. This puts the original condition of Smale for Newton's method in a more general perspective. The results are also discussed in th...
متن کاملMore Quadratically Converging Algorithms for $\pi$
We present a quadratically converging algorithm for or based on a formula of Legendre's for complete elliptic integrals of modulus sin(7r/12) and the arithmetic-geometric mean iteration of Gauss and Legendre. Precise asymptotics are provided which show this algorithm to be (marginally) the most efficient developed to date. As such it provides a natural computational check for the recent large-s...
متن کاملLocal energy-optimizing subdivision algorithms
In this paper a method is presented to fair the limit surface of a subdivision algorithm locally around an extraordinary point. The dominant six eigenvalues of the subdivision matrix have to satisfy linear and quadratic equalityand inequality-constraints in order to guarantee normal-continuity and bounded curvature at the extraordinary point. All other eigenvalues can be chosen arbitrarily with...
متن کاملSubdivision Algorithms for Ruled Surfaces
Recent research has produced results on subdivision in arbitrary manifolds. These results can be applied to the manifold of lines and thus we can create subdivision schemes especially for ruled surfaces. We present different methods for refining discrete models of ruled surfaces: An algorithm combining subdivision and projection to the manifold of lines in Euclidean three-space. A further algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1986
ISSN: 0377-0427
DOI: 10.1016/0377-0427(86)90088-9